Bounded Variation and Relaxed Curvature of Surfaces

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

p-Lambda-bounded variation

A characteriation of continuity of the $p$-$Lambda$-variation function is given and the Helly's selection principle for $Lambda BV^{(p)}$ functions is established. A characterization of the inclusion of Waterman-Shiba classes into classes of functions with given integral modulus of continuity is given. A useful estimate on modulus of variation of functions of class $Lambda BV^{(p)}$ is found.

متن کامل

Surfaces of Bounded Mean Curvature in Riemannian Manifolds

Consider a sequence of closed, orientable surfaces of fixed genus g in a Riemannian manifold M with uniform upper bounds on mean curvature and area. We show that on passing to a subsequence and choosing appropriate parametrisations, the inclusion maps converge in C to a map from a surface of genus g to M . We also show that, on passing to a further subsequence, the distance functions correspond...

متن کامل

Surfaces of Constant Mean Curvature Bounded by Convex Curves

This paper proves that an embedded compact surface in the Euclidean space with constant mean curvature H 6= 0 bounded by a circle of radius 1 and included in a slab of width 1=jHj is a spherical cap. Also, we give partial answers to the problem when a surface with constant mean curvature and planar boundary lies in one of the halfspaces determined by the plane containing the boundary, exactly, ...

متن کامل

Bounded-Curvature Path Normalization

We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.

متن کامل

Convex tours of bounded curvature

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with n vertices. We present an O(m + n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Milan Journal of Mathematics

سال: 2020

ISSN: 1424-9286,1424-9294

DOI: 10.1007/s00032-020-00311-w